Instance-Specific Remodelling of Planning Domains by Adding Macros and Removing Operators

نویسندگان

  • Maher A. Alhossaini
  • J. Christopher Beck
چکیده

We propose an approach to remodelling classical planning domains via the addition of macro operators and removal of original operators either for the domain as a whole or instance-by-instance. For the latter remodelling, we train a predictor to choose the best reformulation of the domain based on instance characteristic. In the domain level remodelling, we try find a fixed remodelling that works best on average over our training set. Operator removal does not generally preserve solubility and proving solubility preservation of domain models is PSPACE-complete. So we use an approach that uses training instances to empirically estimate the probability of solubility preservation and maintains a minimum value of that probability on the training instances. We show that the instance-specific approach outperforms the traditional best-on-average macro-only remodelling approach in 9 out of 14 cases of domain/macro-source combinations, and that it can outperform fixed domain-based models generated with existing macro learning tools.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning to Choose Instance-Specific Macro Operators

The acquisition and use of macro actions has been shown to be effective in improving the speed of AI planners. Current macro acquisition work focuses on finding macro sets that, when added to the domain, can improve the average solving performance. In this paper, we present Instance-specific macro learning. This kind of macro filtering depends on building a predictor that can be used to estimat...

متن کامل

MUM: A Technique for Maximising the Utility of Macro-operators by Constrained Generation and Use

Research into techniques that reformulate problems to make general solvers more efficiently derive solutions has attracted much attention, in particular when the reformulation process is to some degree solver and domain independent. There are major challenges to overcome when applying such techniques to automated planning, however: reformulation methods such as adding macro-operators (macros, f...

متن کامل

Macro Learning in Planning as Parameter Configuration

In AI planning, macro learning is the task of finding subsequences of operators that can be added to the planning domain to improve planner performance. Typically, a single set is added to the domain for all problem instances. A number of techniques have been developed to generate such a macro set based on offline analysis of problem instances. We build on recent work on instance-specific and f...

متن کامل

Evolving Macro-Actions for Planning

Domain re-engineering through macro-actions (i.e. macros) provides one potential avenue for research into learning for planning. However, most existing work learns macros that are reusable plan fragments and so observable from planner behaviours online or plan characteristics offline. Also, there are learning methods that learn macros from domain analysis. Nevertheless, most of these methods ex...

متن کامل

Exploiting Block Deordering for Improving Planners Efficiency

Capturing and exploiting structural knowledge of planning problems has shown to be a successful strategy for making the planning process more efficient. Plans can be decomposed into its constituent coherent subplans, called blocks, that encapsulate some effects and preconditions, reducing interference and thus allowing more deordering of plans. According to the nature of blocks, they can be str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013